New Symbolic Algorithms For Solving A General Bordered Tridiagonal Linear System

نویسنده

  • A. A. Karawia
چکیده

X iv :1 30 3. 07 38 v1 [ cs .S C ] 4 M ar 2 01 3 New Symbolic Algorithms For Solving A General Bordered Tridiagonal Linear System A. A. KARAWIA∗ Computer science unit, Deanship of educational services, Qassim University, P.O.Box 6595, Buraidah 51452, Saudi Arabia. E-mail: [email protected] Abstract In this paper, the author present reliable symbolic algorithms for solving a general bordered tridiagonal linear system. The first algorithm is based on the LU decomposition of the coefficient matrix and the computational cost of it is O(n). The second is based on The Sherman-Morrison-Woodbury formula. The algorithms are implementable to the Computer Algebra System (CAS) such as MAPLE, MATLAB and MATHEMATICA. Three examples are presented for the sake of illustration.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Symbolic Algorithm for Solving General Opposite-Bordered Tridiagonal Linear Systems

In the current article we propose a new efficient, reliable and breakdown-free algorithm for solving general opposite-bordered tridiagonal linear systems. An explicit formula for computing the determinant of an opposite-bordered tridiagonal matrix is investigated. Some illustrative examples are given.

متن کامل

On Solving Pentadiagonal Linear Systems via Transformations

Many authors studied numeric algorithms for solving the linear systems of the pentadiagonal type. The well-known Fast Pentadiagonal System Solver algorithm is an example of such algorithms. The current article is describes new numeric and symbolic algorithms for solving pentadiagonal linear systems via transformations. New algorithms are natural generalization of the work presented in [Moawwad ...

متن کامل

A New Two-stage Iterative Method for Linear Systems and Its Application in Solving Poisson's Equation

In the current study we investigate the two-stage iterative method for solving linear systems. Our new results shows which splitting generates convergence fast in iterative methods. Finally, we solve the Poisson-Block tridiagonal matrix from Poisson's equation which arises in mechanical engineering and theoretical physics. Numerical computations are presented based on a particular linear system...

متن کامل

Symbolic algorithm for solving comrade linear systems based on a modified Stair-Diagonal Approach

Recently, new approach called Stair-Diagonal used for solving a tridiagonal system by Jawad[A. J. Jawad and et.al., Solving a Tri-Diagonal System of Size N Equations by Stair-Diagonal Approach, Adv. Sci. Eng. Med. , 4(2012) 171-175]. In this paper, we developed a Stair-Diagonal Approach in order to remove the cases where the Stair-Diagonal Approach fails. Also, we describe a symbolic computatio...

متن کامل

Some algorithms for solving special tridiagonal block Toeplitz linear systems

This paper is focused on di1erent methods and algorithms for solving tridiagonal block Toeplitz systems of linear equations. We consider the El-Sayed method (Ph.D. Thesis, 1996) for such systems and propose several modi9cations that lead to di1erent algorithms, which we discuss in detail. Our algorithms are then compared with some classical techniques as far as implementation time is concerned,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1303.0738  شماره 

صفحات  -

تاریخ انتشار 2013